Informatics Publishing Limited

P. Venkadesh ¹, Julia Punitha Malar Dhas ², S. V. Divya ³

Affiliations
1 CSE Department, Noorul Islam Centre for Higher Education, N.I. University, Kumaracoil, Thuckalay, IN
2 CSE Department, Noorul Islam Centre for Higher Education, Kumaracoil, Thuckalay, IN
3 IT Department, Noorul Islam Centre for Higher Education, N.I.University, Kumaracoil, Thuckalay, IN

Abstract

During the past few years computers were single-homed and hence TCP/IP protocols were used and nowadays there is a need for mobility, therefore new protocols were designed to support the mobility and multi-homing facilities. The Stream Control Transmission Protocol (SCTP) is a newly designed youngest transport layer protocol which provides services similar to TCP-plus a set of advanced features to utilize the enhanced capabilities of modern IP networks and to support increased application requirements. All major operating systems used in nowadays have SCTP implementation. In this paper, we focus on the important features, security issues and an enhanced frame work model for secure key management and thereby providing a secure data transmission in SCTP communication. We also analyzed the throughput performance of our proposed method with the basic SCTP communication.

Keywords

Multi-Streaming, Multi-Homing, Stream Control Transmission Protocol, Transport Layer Security.

Full Text

     

P. Mahesh ¹, M. Deepa Lakshmi ¹, Julia Punitha Malar Dhas ²

Affiliations
1 PSN College of Engineering & Technology, IN
2 N.I University, IN

Abstract

A large number of Web Services structure a Service Oriented Architecture (SOA) and facilitate the creation of distributed applications over web. The ability to discover and invoke a web service is a major challenge in Service Oriented Architectures (SOA). The matchmaking algorithm is the important component to discover the services. Initially, keyword matchmaking technologies (Syntax-based search) were used to discover the web services. But they had serious limitations-retrieval of many irrelevant services. To overcome this, semantics-based matchmaking algorithms were proposed. Most of the algorithms were based on M. Paolucci et al. It is seen that precision of these algorithms were too low. So our proposed work focuses on improving the matchmaking process by combining functional similarity matching (using bipartite graph) and textual similarity matching. The proposed technique is applied to a sample test collection and experimental results are presented, which demonstrate the effectiveness of the idea.

Keywords

Bipartite Graph Matching, Matchmaking Algorithm, Similarity Measurement and Web Service Discovery.

Full Text